Programming complexity

Results: 456



#Item
301COLLABORATIVE COMPUTATION ON THE FLOOR  Y. FERNAEUS & J. THOLANDER DSV, Stockholm University, Sweden [removed], [removed] Abstract. One common problem in children’s programming is that it is difficult to u

COLLABORATIVE COMPUTATION ON THE FLOOR Y. FERNAEUS & J. THOLANDER DSV, Stockholm University, Sweden [removed], [removed] Abstract. One common problem in children’s programming is that it is difficult to u

Add to Reading List

Source URL: www.lkl.ac.uk

Language: English - Date: 2008-11-26 09:05:32
302Rich Hickey  What is Datomic? • A new database • Bringing data power into the application • A sound model of information, with time

Rich Hickey What is Datomic? • A new database • Bringing data power into the application • A sound model of information, with time

Add to Reading List

Source URL: wiki.jvmlangsummit.com

Language: English - Date: 2012-08-01 16:09:09
303Interior Point Methods twenty years after Florian A. Potra [removed]  Department of Mathematics and Statistics

Interior Point Methods twenty years after Florian A. Potra [removed] Department of Mathematics and Statistics

Add to Reading List

Source URL: www.math.umbc.edu

Language: English - Date: 2003-09-28 23:27:42
304Computer Science Technical Report Enabling Code Generation within the Sparse Polyhedral Framework Alan LaMielle, Michelle Strout

Computer Science Technical Report Enabling Code Generation within the Sparse Polyhedral Framework Alan LaMielle, Michelle Strout

Add to Reading List

Source URL: www.cs.colostate.edu

Language: English - Date: 2010-03-26 19:39:03
305An Automatic Parallelization Framework for Algebraic Computation Systems Yue Li Gabriel Dos Reis

An Automatic Parallelization Framework for Algebraic Computation Systems Yue Li Gabriel Dos Reis

Add to Reading List

Source URL: paradise.caltech.edu

Language: English - Date: 2014-05-18 16:52:59
306Random Constraint Satisfaction: Easy Generation of Hard (Satisfiable) Instances Ke Xu 1,∗ National Lab of Software Development Environment, School of Computers,

Random Constraint Satisfaction: Easy Generation of Hard (Satisfiable) Instances Ke Xu 1,∗ National Lab of Software Development Environment, School of Computers,

Add to Reading List

Source URL: www.nlsde.buaa.edu.cn

Language: English - Date: 2007-04-10 23:13:08
307Yuan Zhou Wednesday, March 12, [removed]:30 am  Maple Room, IMU

Yuan Zhou Wednesday, March 12, [removed]:30 am Maple Room, IMU

Add to Reading List

Source URL: emails.soic.indiana.edu

Language: English - Date: 2014-02-28 12:08:53
308The Everest Framework A flexible Application Programming Interface for HL7v3 messaging Technical Report, April 2011 this report: Addressing Complexity P.1

The Everest Framework A flexible Application Programming Interface for HL7v3 messaging Technical Report, April 2011 this report: Addressing Complexity P.1

Add to Reading List

Source URL: www.mohawkcollege.ca

Language: English - Date: 2011-06-06 10:15:06
309Sage Reference Manual: Numerical Optimization Release 6.3 The Sage Development Team

Sage Reference Manual: Numerical Optimization Release 6.3 The Sage Development Team

Add to Reading List

Source URL: www.sagemath.org

Language: English - Date: 2014-11-16 14:58:22
310focus 1 adapting agility Context-Adaptive Agility: Managing Complexity and Uncertainty

focus 1 adapting agility Context-Adaptive Agility: Managing Complexity and Uncertainty

Add to Reading List

Source URL: toddlittleweb.com

Language: English - Date: 2006-05-15 21:39:46